Packing Segments in a Convex 3-Polytope is NP-hard
نویسندگان
چکیده
We show it is NP-hard to pack the maximum number of segments in a convex 3-dimensional polytope. We show this packing problem is also NP-hard for general polygonal regions in the plane. This problem relates two streams of research, Kakeya set problems and packing problems.
منابع مشابه
A Hard Convex Core Yukawa Equation of State for Nonassociated Chain Molecules
The compressibility factor of nonassociated chain molecules composed of hard convex core Yukawa segments was derived with SAFT-VR and an extension of the Barker-Henderson perturbation theory for convex bodies. The temperature-dependent chain and dispersion compressibility factors were derived using the Yukawa potential. The effects of temperature, packing fraction, and segment number on the com...
متن کاملAffine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
We consider two polytopes. The quadratic assignment polytope QAP(n) is the convex hull of the set of tensors x⊗x, x ∈ Pn, where Pn is the set of n×n permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph Kn we consider appropriate (n 2 ) × (n 2 ) permutation matrix of the edges of Kn. The Young polytope P ((n − 2, 2)) is the conv...
متن کاملApproximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems which are NP-hard we develop efficient constant factor approximation algorithms.
متن کاملThe complexity of finding small triangulations of convex 3-polytopes
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is NP -hard. We discuss other related complexity results.
متن کاملA Generalization of Odd Set Inequalities for the Set Packing Problem
The set packing problem, sometimes also called the stable set problem, is a well-known NP-hard problem in combinatorial optimization with a wide range of applications and an interesting polyhedral structure, that has been the subject of intensive study. We contribute to this field by showing how, employing cliques, odd set inequalities for the matching problem can be generalized to valid inequa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014